Completing Inverse Entailment

نویسنده

  • Stephen Muggleton
چکیده

Yamamoto has shown that the Inverse Entailment (IE) mechanism described previously by the author is complete for Plotkin's relative subsumption but incomplete for entailment. That is to say, an hy-pothesised clause H can be derived from an example E under a background theory B using IE if and only if H subsumes E relative to B in Plotkin's sense. Yamamoto gives examples of H for which B H j = E but H cannot be constructed using IE from B and E. The main result of the present paper is a theorem to show that by enlarging the bottom set used within IE, it is possible to make a revised version of IE complete with respect to entailment for Horn theories. Furthermore, it is shown for function-free deenite clauses that given a bound k on the arity of predicates used in B and E, the cardinality of the enlarged bottom set is bounded above by the polynomial function p(c + 1) k , where p is the number of predicates in B; E and c is the number of constants in B E.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Inverse Entailment for Full Clausal Theories

This paper shows a sound and complete method for inverse entailment in inductive logic programming. We show that inverse entailment can be computed with a resolution method for consequencending. In comparison with previous work, induction via consequencending is sound and complete for nding hypotheses from full clausal theories, and can be used for inducing not only de nite clauses but also non...

متن کامل

From Inverse Entailment to Inverse Subsumption

Modern explanatory ILP methods like Progol, Residue procedure, CF-induction, HAIL and Imparo use the principle of Inverse Entailment (IE). It is based on the fact that the negation of a hypothesis is derived from a prior background theory and the negation of examples. IE-based methods commonly compute a hypothesis in two steps: by first constructing an intermediate theory and next by generalizi...

متن کامل

Inductive Logic Programming: Inverse Resolution and Beyond

This talk is based on a paper which appears in the May 1995 issue of New Generation Computing Journal under the title "Inverse entailment and Progol." The paper is available as gzipped Postscript by anonymous ftp from ftp.comlab.ox.ac.uk in file pub/Packages/ILP/Papers/InvEnt.ps.gz The paper firstly provides a reappraisal of the development of techniques for inverting deduction, secondly introd...

متن کامل

Which Hypotheses Can Be Found with Inverse Entailment?

In this paper we give a completeness theorem of an inductive inference rule inverse entailment proposed by Muggleton. Our main result is that a hypothesis clause H can be derived from an example E under a background theory B with inverse entailment i H subsumes E relative to B in Plotkin's sense. The theory B can be any clausal theory, and the example E can be any clause which is neither a taut...

متن کامل

Inverse Entailment in Nonmonotonic Logic Programs

Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998